Multiple Tasks for Multiple Objectives: A New Multiobjective Optimization Method via Multitask Optimization
نویسندگان
چکیده
Handling conflicting objectives and finding multiple Pareto optimal solutions are two challenging issues in solving multiobjective optimization problems (MOPs). Inspired by the efficiency of multitask (MTO) problem (MTOP), we propose to treat MOP as a MTOP solve it using MTO. By transforming into MTOP, not only that difficulty handling can be avoided, but also MTO help efficiently find well-distributed for MOP. With above idea, this paper proposes new method via MTO, with following three contributions. Firstly, theorem is proposed theoretically show relationship between how transformed MTOP. Secondly, based on theoretical analysis, tasks (MTMO) framework efficiently. Thirdly, MTMO-based evolutionary algorithm developed MOP, together novel strategies. One target point estimation strategy automatically accurately. The other an archive-based implicit knowledge transfer transferring across enhance results together. superiority validated extensive experiments 15 MOPs objective numbers varying from 3 20 six state-of-the-art algorithms competitors. Therefore, even many-objective new, promising, efficient method.
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Online Stochastic Optimization with Multiple Objectives
In this paper we propose a general framework to characterize and solve the stochastic optimization problems with multiple objectives underlying many real world learning applications. We first propose a projection based algorithm which attains an O(T−1/3) convergence rate. Then, by leveraging on the theory of Lagrangian in constrained optimization, we devise a novel primal-dual stochastic approx...
متن کاملCondition based maintenance optimization considering multiple objectives
In condition based maintenance (CBM) optimization, the main optimization objectives include maximizing reliability and minimizing maintenance costs, which are often times conflicting to each other. In this work, we develop a physical programming based approach to deal with the multi-objective condition based maintenance optimization problem. Physical programming presents two major advantages: (...
متن کاملStochastic Convex Optimization with Multiple Objectives
In this paper, we are interested in the development of efficient algorithms for convex optimization problems in the simultaneous presence of multiple objectives and stochasticity in the first-order information. We cast the stochastic multiple objective optimization problem into a constrained optimization problem by choosing one function as the objective and try to bound other objectives by appr...
متن کاملNewton's Method for Multiobjective Optimization
We propose an extension of Newton’s Method for unconstrained multiobjective optimization (multicriteria optimization). The method does not scalarize the original vector optimization problem, i.e. we do not make use of any of the classical techniques that transform a multiobjective problem into a family of standard optimization problems. Neither ordering information nor weighting factors for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2023
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2023.3294307